A Penalty-Sensitive Branch Predictor

نویسندگان

  • Yue Hu
  • David M. Koppelman
  • Lu Peng
چکیده

Branch predictor design is typically focused only on minimizing the misprediction rate (MR), while ignores misprediction penalty.Because the misprediction penalty varies widely from branch to branch, performance might get improved by using a predictor that makes a greater effort to predict high-penalty branches, at the expense of the other, even if the total number of mispredictions doesn't change. A penalty-sensitive predictor was developed based on this idea. It includes a penalty predictor to predict whether a branch is high or low penalty. Then, a twoclass TAGE predictor is developed to favor high-penalty branches at the expense of low-penalty branches. Experiment shows although the overall performance improvement is limited, the penalty-sensitive mechanism successfully decreases the MR of the highpenalty branches while increasing the MR of the lowpenalty branches by a small amount.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Path Based Local Perceptron Branch Predictor

As the number of pipeline stages increases we become hostage to the penalty imposed by misprediction of branches. Previous works have shown that a neural branch predictor remains victorious among its peers by achieving much lower misprediction rates on similar sized hardware budget than traditional approaches. In this paper we implement 3 variations of perceptron based predictor and give each i...

متن کامل

Using Branch Prediction Information for Near-Optimal I-Cache Leakage

This paper describes a new on-demand wakeup prediction policy for instruction cache leakage control that achieves better leakage savings than prior policies, and avoids the performance overheads of prior policies. The proposed policy reduces leakage energy by more than 92% with only less than 0.3% performance overhead on average. The key to this new on-demand policy is to use branch prediction ...

متن کامل

Analysis of Combined Bimodal and GShare Branch Prediction Schemes

Taking advantage of instruction level parallelism is one of the key factors in improving computer performance. The main performance inhibitor in a pipelined processor is the branch penalty. Many techniques have been developed to reduce this penalty. The technique of branch prediction was explored further. Branch predictors are crucial in today's modern, superscalar processors for achieving high...

متن کامل

Using Branch Prediction Information for Near-Optimal I-Cache Leakage Reduction

This paper describes a new on-demand wakeup prediction policy for instruction cache leakage control that achieves better leakage savings than prior policies, and avoids the performance overheads of prior policies. The proposed policy reduces leakage energy by more than 92% with only less than 0.3% performance overhead on average, whereas prior policies were either prone to severe performance ov...

متن کامل

Nonnegative least squares solution in inequality sense via LCP reformulation

In this paper, a monotone linear complementarity reformulation of the nonnegative least squares problems in inequality sense is introduced. Then Mehrotra’s predictor-corrector interior point algorithm is applied to solve the resulting monotone linear complementarity problem. Our numerical experiments on several randomly generated test problems show that Mehrotra’s algorithm overperforms the wid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011